On Resolvability- and Domination-Related Parameters of Complete Multipartite Graphs

Domination games played on line graphs of complete multipartite graphs

The domination game on a graph G (introduced by B. Brešar, S. Klavžar, D.F. Rall [1]) consists of two players, Dominator and Staller, who take turns choosing a vertex from G such that whenever a vertex is chosen by either player, at least one additional vertex is dominated. Dominator wishes to dominate the graph in as few steps as possible, and Staller wishes to delay this process as much as po...

Signed and Minus Domination in Complete Multipartite Graphs

In this paper we determine the exact values of the signed domination number, signed total domination number, and minus domination number of complete multipartite graphs, which substantially generalizes some previous results obtained for special subclasses of complete multipartite graphs such as cliques and complete bipartite graphs.

The p-domination number of complete multipartite graphs

Partitioned Graphs and Domination Related Parameters

Let G be a graph of order n ≥ 2 and n1, n2, .., nk be integers such that 1 ≤ n1 ≤ n2 ≤ .. ≤ nk and n1 + n2 + .. + nk = n. Let for i = 1, .., k: Ai ⊆ Kni where Km is the set of all pairwise non-isomorphic graphs of order m, m = 1, 2, ... In this paper we study when for a domination related parameter μ (such as domination number, independent domination number and acyclic domination number) is ful...

On graphs with complete multipartite µ-graphs